Logical , Testing , and Observation Equivalence for Processes in a Linear Logic Programming

Linear logic programming has recently been proposed and shown to be able to integrate a wide range of mechanisms for concurrent computation uniformly in terms of proof search. This paper introduces several process equivalence relations for linear logic programming and investigate relationships between them in order to establish foundations for program transformation in linear logic programming. We also introduce unfold/fold transformation procedure for linear logic programming and prove its soundness with respect to a testing equivalence.